Syntax: Theory and Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Syntax Evolution: Problems and Recursion

We are Turing complete, and natural language parsing is decidable, so our syntactic abilities are in excess to those needed to speak a natural language. This is an anomaly, because evolution would not select and keep an overqualified feature. We solve this anomaly by using a coincidence, both syntax and problem solving are computing, and a difference, Turing completeness is not a requirement of...

متن کامل

Problems with OWL Syntax

In this paper we discuss three problems with OWL syntax that repeatedly surface in practice. The first problem is that OWL does not allow for explicit declarations—assertions that a certain class, property, or an individual exists in an ontology. This aspect of the OWL standard was often misinterpreted, which caused design errors in OWL APIs; moreover, the lack of declarations makes devising an...

متن کامل

Ritual Syntax and Cognitive Theory

ing from the text, we find the following order of specific actions (n.b.: numbers assigned to actions here do not correspond to numbers assigned to stanzas by Dumont as found in the appended translation):

متن کامل

Description Theory and Approach about Space Syntax Methodology in Urban Design Process

Nowadays space is considered to be a net of connections between different areas. The questions how to delineate its character and how it is possible to objectively compare two spaces is a matter under consideration. This was the reason for creating new theories about the structure of space. Space syntax analysis (SSA) or simply Space Syntax defines a number of theories and research areas devo...

متن کامل

Homotopy Model Theory I: Syntax and Semantics

A model theory in the framework of Univalent Foundations requires a logic that allows us to define structures on homotopy (n-)types, similar to how first-order logic can define structures on sets. We define such an “n-level” logic for finite n. The syntax is based on a generalization of Makkai’s FOLDS, obtained by an operation that allows us to add equality sorts to FOLDS-signatures. We then gi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Language

سال: 1994

ISSN: 0097-8507

DOI: 10.2307/415837